Computational burden reduction in min–max MPC
نویسندگان
چکیده
منابع مشابه
Computational burden reduction in Set-membership Hammerstein system identification
Hammerstein system identification from measurements affected by bounded noise is considered in the paper. First, we show that the computation of tight parameter bounds requires the solution to nonconvex optimization problems where the number of decision variables increases with the length of the experimental data sequence. Then, in order to reduce the computational burden of the identification ...
متن کاملComplexity Reduction in Explicit MPC through Model Reduction
In this paper we propose to use model reduction techniques to make explicit model predictive control possible and more attractive for a larger number of applications and for longer control horizons. The main drawback of explicit model predictive control is the large increase in controller complexity as the problem size increases. For this reason, the procedure is limited to applications with lo...
متن کاملMPC vs. SFE : Unconditional and Computational Security
In secure computation among a set P of players one considers an adversary who can corrupt certain players. The three usually considered types of corruption are active, passive, and fail corruption. The adversary’s corruption power is characterized by a so-called adversary structure which enumerates the adversary’s corruption options, each option being a triple (A, E, F ) of subsets of P , where...
متن کاملCoordinator Local Local Local Local Local Local Local MPC MPC MPC MPC MPC MPC MPC
In many cases economic optimal operation is the same as maximum plant throughput, which is the same as maximum flow through the bottleneck(s). This insight may greatly simplify implementation. In this paper, we consider the case where the bottlenecks may move, with parallel flows that give rise to multiple bottlenecks and with crossover flows as extra degrees of freedom. With the assumption tha...
متن کاملFunction template std : : minmax and / or algorithm std : : minmax _ element
This proposal adds a function template (std::minmax) and / or an algorithm (std::minmax_element) to the header , both of which are implicitly present (by two separate calls to std::min and std::max, or std::min_element and std::max_element), but admit a better implementation if the two calls are combined into one. Both additions can be considered independently, although they are stro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Franklin Institute
سال: 2011
ISSN: 0016-0032
DOI: 10.1016/j.jfranklin.2011.07.008